Image fragile watermarking algorithm based on deneighbourhood mapping

To address the security risk caused by fixed offset mapping and limited recoverability of random used in image watermarking, a self-embedding fragile watermarking algorithm based on deneighbourhood are proposed. First, is divided into several 2 × blocks, authentication watermark recovery generated average value blocks. Then, denighbourhood implemented as, for each block, its block randomly selected outside neighbourhood. Finally, embedded itself block. Theoretical analysis indicates that case continuous area tampering, proposed can achieve better rate than method mapping. The experimental results verify rationality effectiveness theoretical analysis. Moreover, compared with existing embedding algorithms mapping, chaos Arnold also achieves higher rate.